搜索资源列表
Huffman
- 实现哈夫曼编码,通过建哈弗曼树实现代码,环境为VC-Huffman tree
Huffman
- 使用霍夫曼树对字符串加密,使用图形界面完成,显示每个字母出现次数-Using the Huffman tree of string encryption, using the graphical interface finished, show the number of occurrences of each letter
Huffman-encoding-and-decoding-tree
- 哈夫曼树编码解码,在程序中使用树结构,实现哈夫曼树,核心类:树结构类哈夫曼编解码器类;文本处理类;主程序类-Huffman encoding and decoding tree, the tree structure used in the program to achieve Huffman tree, the core categories: tree class class Huffman codec text processing classes main categories
huffman
- 数据结构构建哈夫曼树C++源代码及实验报告-Construction of the Huffman tree data structure C++ source code and test reports
huffman
- 对任意输入的一段英文,为每个字符编制其相应的赫夫曼编码;并利用该编码为任意输入的0、1序列进行解码. 基本要求:一个完整的系统应具有以下功能: (1)初始化 从终端读入一段英文字符,统计每个字符出现的频率,建立赫夫曼树,并将该树存入某文件; (2)编码 利用建好的赫夫曼树对各字符进行编码,用列表的形式显示在屏幕上,并将编码结果存入另一文件中; (3)解码 利用保存的赫夫曼编码,对任意输入的0,1序列能正确解码; -Section for any input in Eng
Huffman
- 哈夫曼树 用vc6.0编写的哈夫曼树 -Huffman Huffman tree, the tree prepared by vc6.0
huffman
- 哈弗曼编译码器,可编译码、查单词出现频率、显示哈夫曼树、显示编码表-Ha Fuman codec can be encoding and decoding, checking the frequency of the word, showing Huffman tree coding table shown
Huffman-coding
- 哈夫曼编码是哈夫曼树(最优二叉树)在通信编码中的应用。在本程序中,只定义了5个数据的哈夫曼编码,分别输入五个数据的权值,就可以得出最终的哈夫曼编码。-Huffman coding is Huffman tree (the optimal binary tree) in the communication code of the application. In this program, only the data defined Huffman 5, respectively, the weig
huffman
- Huffman树形结构,结构体的建立,树的建立、查找、删除-Huffman tree structure, the structure of the establishment, the establishment of the tree, find, delete ... ...
huffman
- 哈夫曼树的c语言程序 数据结构实验专用 绝对能用 -Huffman tree data structure c language program can definitely experiment dedicated
Huffman
- 给定n个权值作为n个叶子结点,构造一棵二叉树,若带权路径长度达到最小,称这样的二叉树为最优二叉树,也称为哈夫曼树(Huffman tree)。-Given the right value as the n-n-leaf node, a binary tree structure, if the minimum weighted path length, saying such a binary tree for the optimal binary tree, also called Huffm
huffman
- 解决huffman树问题:从文件读入一段文本,计算其中每一个字符的huffman编码,输出编码后文本的长度。-Solve the huffman tree problem: a piece of text read from file, calculate each of the characters huffman coding, the output length of the encoded text.
Huffman
- 数据结构程序,用于通过哈夫曼树进行编码和译码。-Data structure program used to encode and decode Huffman tree.
Huffman-algorithm
- 哈夫曼算法及其应用 给定n个权值作为n个叶子结点,构造一棵二叉树,若带权路径长度达到最小,称这样的二叉树为最优二叉树,也称为哈夫曼树。哈夫曼编码是一种根据哈夫曼树对文件进行编码的方式。哈夫曼编码是可变字长编码的一种。本次课程设计是对一个已建文本文件,统计该文件中各字符频率,对各字符进行Huffman编码,将该文件翻译成Huffman编码文件,再将Huffman编码文件翻译成原文件。压缩文件即读文件,统计文件中的字符个数,对文件进行哈夫曼编码和译码,并将编码译码后的字符存储在文件中。-
Huffman
- 实现huffman树的编程实现,比较函数很新颖,值得借鉴。-Implement huffman tree programming, more functions are new, worth learning from.
Huffman-tree-yang
- 哈弗曼树,讲课比赛教案,供参考,倾力奉献-Hafu Man tree, lectures game lesson plans, for reference, dedicated effort
adaptive-huffman
- It is a program to compress the entered file text using the adaptive huffman compression algorithm which dynamically builds a tree according to the input string
Huffman
- 霍夫曼编码,生成霍夫曼树。用VC6.0编译,控制台应用程序-Huffman coding, Huffman tree generated. With VC6.0 compiler, a console application
Huffman
- 运用赫夫曼编码的最优前缀码的贪心算法构造huffman树: 首先扫描输入文件,统计出现的字符以及每个字符出现的次数。每次取出现次数最小的那两个节点(node)合并成一个节点(node),并且将累计数值相加作为新的接点的累计数值,最顶层的是根节点(root) -Huffman coding using optimal prefix code of the greedy algorithm constructs huffman tree: First, scan the input file,
huffman
- 自适应(或动态)哈夫曼算法取消了统计,可在压缩数据时动态调整哈夫曼树,这样可提高速度。因此,哈夫曼编码效率高,运算速度快,实现方式灵活。-Adaptive (or dynamic) Huffman algorithm to cancel the statistics, the data can be dynamically adjusted in the compressed Huffman tree, which can improve speed. Therefore, the Huffma